Solving Weighted Least Squares (WLS) problems on ARM-based architectures
نویسندگان
چکیده
منابع مشابه
On Solving Large-Scale Weighted Least Squares Problems
A sequence of least squares problems of the form miny kG 1=2 (A T y ? h)k2 where G is an n n positive deenite diagonal weight matrix, and A an m n (m < n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We discuss a technique for forming low-rank correction pre-conditioners for su...
متن کاملPower System State Estimation Using Weighted Least Squares (WLS) and Regularized Weighted Least Squares(RWLS) Method
In this paper, a new formulation for power system state estimation is proposed. The formulation is based on regularized least squares method which uses the principle of Thikonov’s regularization to overcome the limitations of conventional state estimation methods. In this approach, the mathematical unfeasibility which results from the lack of measurements in case of ill-posed problems is elimin...
متن کاملWeighted/Structured Total Least Squares problems and polynomial system solving
Weighted and Structured Total Least Squares (W/STLS) problems are generalizations of Total Least Squares with additional weighting and/or structure constraints. W/STLS are found at the heart of several mathematical engineering techniques, such as statistics and systems theory, and are typically solved by local optimization methods, having the drawback that one cannot guarantee global optimality...
متن کاملSolving Regularized Total Least Squares Problems Based on Eigenproblems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we summarize two iterative methods which are based on a sequence of eigenproblems. The focus is on efficient implementation with...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2016
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-016-1910-9